Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar1/AProVESLASHrta1.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

plus₂(s₁(s₁(x)), y) -> s₁(plus₂(x, s₁(y)))
plus₂(x, s₁(s₁(y))) -> s₁(plus₂(s₁(x), y))
plus₂(s₁(0), y) -> s₁(y)
plus₂(0, y) -> y
ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, plus₂(y, ack₂(s₁(x), y)))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

plus₂(s₁(s₁(x)), y) -> s₁(plus₂(x, s₁(y)))
plus₂(x, s₁(s₁(y))) -> s₁(plus₂(s₁(x), y))
plus₂(s₁(0), y) -> s₁(y)
plus₂(0, y) -> y
ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, plus₂(y, ack₂(s₁(x), y)))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> ACK₂(x, plus₂(y, ack₂(s₁(x), y)))
PLUS₂(x, s₁(s₁(y))) -> PLUS₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> PLUS₂(y, ack₂(s₁(x), y))
PLUS₂(s₁(s₁(x)), y) -> PLUS₂(x, s₁(y))
ACK₂(s₁(x), 0) -> ACK₂(x, s₁(0))

The TRS R consists of the following rules:

plus₂(s₁(s₁(x)), y) -> s₁(plus₂(x, s₁(y)))
plus₂(x, s₁(s₁(y))) -> s₁(plus₂(s₁(x), y))
plus₂(s₁(0), y) -> s₁(y)
plus₂(0, y) -> y
ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, plus₂(y, ack₂(s₁(x), y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> ACK₂(x, plus₂(y, ack₂(s₁(x), y)))
PLUS₂(x, s₁(s₁(y))) -> PLUS₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> PLUS₂(y, ack₂(s₁(x), y))
PLUS₂(s₁(s₁(x)), y) -> PLUS₂(x, s₁(y))
ACK₂(s₁(x), 0) -> ACK₂(x, s₁(0))

The TRS R consists of the following rules:

plus₂(s₁(s₁(x)), y) -> s₁(plus₂(x, s₁(y)))
plus₂(x, s₁(s₁(y))) -> s₁(plus₂(s₁(x), y))
plus₂(s₁(0), y) -> s₁(y)
plus₂(0, y) -> y
ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, plus₂(y, ack₂(s₁(x), y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 2 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PLUS₂(x, s₁(s₁(y))) -> PLUS₂(s₁(x), y)
PLUS₂(s₁(s₁(x)), y) -> PLUS₂(x, s₁(y))

The TRS R consists of the following rules:

plus₂(s₁(s₁(x)), y) -> s₁(plus₂(x, s₁(y)))
plus₂(x, s₁(s₁(y))) -> s₁(plus₂(s₁(x), y))
plus₂(s₁(0), y) -> s₁(y)
plus₂(0, y) -> y
ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, plus₂(y, ack₂(s₁(x), y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACK₂(s₁(x), s₁(y)) -> ACK₂(s₁(x), y)
ACK₂(s₁(x), s₁(y)) -> ACK₂(x, plus₂(y, ack₂(s₁(x), y)))
ACK₂(s₁(x), 0) -> ACK₂(x, s₁(0))

The TRS R consists of the following rules:

plus₂(s₁(s₁(x)), y) -> s₁(plus₂(x, s₁(y)))
plus₂(x, s₁(s₁(y))) -> s₁(plus₂(s₁(x), y))
plus₂(s₁(0), y) -> s₁(y)
plus₂(0, y) -> y
ack₂(0, y) -> s₁(y)
ack₂(s₁(x), 0) -> ack₂(x, s₁(0))
ack₂(s₁(x), s₁(y)) -> ack₂(x, plus₂(y, ack₂(s₁(x), y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.